Diclib.com
Словарь ChatGPT

Поиск в словаре Индивидуальные решения

Введите слово или словосочетание на любом языке 👆

Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

как употребляется слово
частота употребления
используется оно чаще в устной или письменной речи
варианты перевода слова
примеры употребления (несколько фраз с переводом)
этимология

idempotent - перевод на французский

PROPERTY OF CERTAIN OPERATIONS IN MATHEMATICS AND COMPUTER SCIENCE, THAT CAN BE APPLIED MULTIPLE TIMES WITHOUT CHANGING THE RESULT BEYOND THE INITIAL APPLICATION

Idempotent function; Idempotency; Idempotence (computer science); Idempotent; Idempotent (software); Indempotency; Indempotent; Idempotent element; Idempotent operator; Idempotent map

idempotent

idempotent, does not change when multiplied by itself, satisfies the equation n x n = n (Mathematics)

Определение

idempotent

1. A function f : D -> D is idempotent if f (f x) = f x for all x in D. I.e. repeated applications have the same effect as one. This can be extended to functions of more than one argument, e.g. Boolean & has x & x = x. Any value in the image of an idempotent function is a fixed point of the function. 2. This term can be used to describe C header files, which contain common definitions and declarations to be included by several source files. If a header file is ever included twice during the same compilation (perhaps due to nested #include files), compilation errors can result unless the header file has protected itself against multiple inclusion; a header file so protected is said to be idempotent. 3. The term can also be used to describe an initialisation subroutine that is arranged to perform some critical action exactly once, even if the routine is called several times. [Jargon File] (1995-01-11)

Показать больше определений

Википедия

Idempotence

Idempotence (UK: , US: ) is the property of certain operations in mathematics and computer science whereby they can be applied multiple times without changing the result beyond the initial application. The concept of idempotence arises in a number of places in abstract algebra (in particular, in the theory of projectors and closure operators) and functional programming (in which it is connected to the property of referential transparency).

The term was introduced by American mathematician Benjamin Peirce in 1870 in the context of elements of algebras that remain invariant when raised to a positive integer power, and literally means "(the quality of having) the same power", from idem + potence (same + power).

https://en.wikipedia.org/wiki/Idempotence